Parameterized circuit complexity and the W hierarchy
نویسندگان
چکیده
منابع مشابه
Parameterized Circuit Complexity and the W Hierarchy
A parameterized problem 〈L, k〉 belongs to W [t] if there exists k′ computed from k such that 〈L, k〉 reduces to the weight-k′ satisfiability problem for weft-t circuits. We relate the fundamental question of whether the W [t] hierarchy is proper to parameterized problems for constant-depth circuits. We define classes G[t] as the analogues of AC depth-t for parameterized problems, and N [t] by we...
متن کاملCdmtcs Research Report Series Parameterized Circuit Complexity and the W
A parameterized problem hL; ki belongs to W [t] if there exists k computed from k such that hL; ki reduces to the weight-k satis ability problem for weft-t circuits. We relate the fundamental question of whether the W [t] hierarchy is proper to parameterized problems for constant-depth circuits. We de ne classes G[t] as the analogues of AC depth-t for parameterized problems, and N [t] by weight...
متن کاملDescriptive complexity and the W hierarchy
The classes W [t] of the Downey-Fellows W hierarchy are defined, for each t, by fixed-parameter reductions to the weighted-assignment satisfiability problem for weft-t circuits. This paper proves that for each t ≥ 1, W [t] equals the closure under fixed-parameter reductions of the class of languages L definable by formulas of the form φ = (∃U)ψ, where U is a set variable and ψ is a first-order ...
متن کاملParameterized Proof Complexity and W[1]
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower bounds for W[1]-parameterized Resolution.
متن کاملSubexponential Parameterized Algorithms Collapse the W - hierarchy ∗ ( Extended
It is shown that for essentially all MAX SNP-hard optimization problems finding exact solutions in subexponential time is not possible unless W [1] = FPT . In particular, we show that O(2p(n)) parameterized algorithms do not exist for Vertex Cover, Max Cut, Max c-Sat, and a number of problems on bounded degree graphs such as Dominating Set and Independent Set, unless W [1] = FPT . Our results a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00317-9